Dynamic real-time capacity constrained routing algorithm for evacuation planning problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evacuation Planning: A Capacity Constrained Routing Approach

Approa h y Qingsong Lu, Yan Huang, Shashi Shekhar Department of Computer S ien e, University of Minnesota 200 Union St SE, Minneapolis, MN 55455 [lqingson; huangyan; shekhar℄ s.umn.edu February 10, 2003 Abstra t Eva uation planning is riti al for appli ations su h as disaster management and homeland defense preparation. EÆ ient tools are needed to produ e eva uation plans to eva uate population...

متن کامل

Capacity Constrained Routing Algorithms for Evacuation Route Planning

Evacuation route planning identifies paths in a given transportation network to minimize the time needed to move vulnerable populations to safe destinations. Evacuation route planning is critical for numerous important applications like disaster emergency management and homeland defense preparation. It is computationally challenging because the number of evacuees often far exceeds the capacity,...

متن کامل

Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results

Evacuation planning is critical for numerous important applications, e.g. disaster emergency management and homeland defense preparation. Efficient tools are needed to produce evacuation plans that identify routes and schedules to evacuate affected populations to safety in the event of natural disasters or terrorist attacks. The existing linear programming approach uses time-expanded networks t...

متن کامل

Proposing a Constrained-GSA for the Vehicle Routing Problem

In the past decades, vehicle routing problem (VRP) has gained considerable attention for its applications in industry, military, and transportation applications. Vehicle routing problem with simultaneous pickup and delivery is an extension of the VRP. This problem is an NP-hard problem; hence finding the best solution for this problem which is using exact method, take inappropriate time, and th...

متن کامل

A Quantum Evolutionary Algorithm for the Vehicle Routing Problem with Single-sided Time Window Setting

Customer service level is of prime importance in today competitive world and has various dimensions with delivery quality being one of the most important ones. Delivery quality has several parameters such as deliver time window options, time window size, etc. In this paper we focus on one of these parameters, namely time window setting. It has a direct impact upon customer satisfaction and busi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indonesian Journal of Electrical Engineering and Computer Science

سال: 2020

ISSN: 2502-4760,2502-4752

DOI: 10.11591/ijeecs.v20.i3.pp1388-1396